Bayesian Community Detection

نویسندگان

  • Morten Mørup
  • Mikkel N. Schmidt
چکیده

Many networks of scientific interest naturally decompose into clusters or communities with comparatively fewer external than internal links; however, current Bayesian models of network communities do not exert this intuitive notion of communities. We formulate a nonparametric Bayesian model for community detection consistent with an intuitive definition of communities and present a Markov chain Monte Carlo procedure for inferring the community structure. A Matlab toolbox with the proposed inference procedure is available for download. On synthetic and real networks, our model detects communities consistent with ground truth, and on real networks, it outperforms existing approaches in predicting missing links. This suggests that community structure is an important structural property of networks that should be explicitly modeled.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Review of Community Detection Approaches in Social Networks using Bayesian Method and Graph Theory

Online social networks create significant challenges to computer scientists, physicists, and sociologists alike, for their massive size, fast evolution, and uncharted potential for social computing. One particular problem that has interested us is community identification. In this review, we focus on “community detection in social networks” through different approaches and techniques mainly Bay...

متن کامل

A Bayesian Framework for Community Detection Integrating Content and Link

This paper addresses the problem of community detection in networked data that combines link and content analysis. Most existing work combines link and content information by a generative model. There are two major shortcomings with the existing approaches. First, they assume that the probability of creating a link between two nodes is determined only by the community memberships of the nodes; ...

متن کامل

Soft Partitioning in Networks via Bayesian Non-negative Matrix Factorization

Identifying overlapping communities in networks is a challenging task. In this work we present a novel approach to community detection that utilizes the Bayesian non-negative matrix factorization (NMF) model to extract overlapping modules from a network. The scheme has the advantage of computational efficiency, soft community membership and an intuitive foundation. We present the performance of...

متن کامل

Efficient Bayesian Community Detection using Non-negative Matrix Factorisation

Identifying overlapping communities in networks is a challenging task. In this work we present a novel approach to community detection that utilises the Bayesian non-negative matrix factorisation (NMF) model to produce a probabilistic output for node memberships. The scheme has the advantage of computational efficiency, soft community membership and an intuitive foundation. We present the perfo...

متن کامل

Overlapping community detection using Bayesian non-negative matrix factorization.

Identifying overlapping communities in networks is a challenging task. In this work we present a probabilistic approach to community detection that utilizes a Bayesian non-negative matrix factorization model to extract overlapping modules from a network. The scheme has the advantage of soft-partitioning solutions, assignment of node participation scores to modules, and an intuitive foundation. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neural computation

دوره 24 9  شماره 

صفحات  -

تاریخ انتشار 2012